Constraint 2 is relaxed
Constraint 3 is not relaxed
Constraint 4 is not relaxed
Constraint 5 is not relaxed
Constraint 6 is not relaxed
The time to read the input and initialise the problem = 1375 ms

Iteration 1
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 93 ms
The lower bound solution is:
z = 3084.000000 + 601.000000 = 3685.000000
The time to read the lower bound solution = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 87385.000000
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1363.000000 + 13156.000000 = 11793.000000
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 11793.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.
The duality gap is acceptably small.
 The current upper (and lower) bound are taken as optimal.
The best upper bound = 11793.000000, the best lower bound = 11793.000000
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 5562 ms
The total time to calculate the lower bounds with CPLEX = 109 ms
The total time to calculate the upper bounds with CPLEX = 16 ms
The total time to create the lower bound problems = 31 ms
The total time to read the lower bound solutions = 16 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 15 ms
The total time to read the upper bound solutions = 0 ms 

The best upper bound found = 11793.000000, the best lower bound found = 11793.000000
Therefore the duality gap is 0.000000%
